Computing densest k-subgraph with structural parameters

Densest k-Subgraph is the problem to find a vertex subset S of size k such that number edges in subgraph induced by maximized. In this paper, we show fixed parameter tractable when parameterized neighborhood diversity, block deletion number, distance-hereditary and cograph respectively. Furthermore, give 2-approximation \(2^{{{\texttt{tc}}(G)}/2}n^{O(1)}\)-time algorithm where \({{\texttt{tc}}(G)}\) twin cover an input graph G.